Low-Complexity Scheduling for Delay Minimization in D2D Communications Using Network Coding

In this letter, we consider the decoding delay minimizing problem for delivering a frame of packets to set user-devices (UDs) using instantly decodable network coding (IDNC). considered device-to-device (D2D) network, UDs have limited coverage zones that represent clusters and can speed up delivery requested other by sending IDNC packets. The minimization is joint optimization selecting transmitting their decisions. work, propose low complexity, yet optimal, solution graph pruning method. Our proposed innovative method introduces sequential algorithm judiciously generates are certainly contributing while simultaneously designing new multi-layer graph. We also prove optimal be achieved generated our algorithm. Numerical results reveal significantly reduces computational complexity compared existing with similar performance.